One-Dimensional Reduction of Multidimensional Persistent Homology
نویسندگان
چکیده
A recent result on size functions is extended to higher homology modules: the persistent homology based on a multidimensional measuring function is reduced to a 1-dimensional one. This leads to a stable distance for multidimensional persistent homology. Some reflections on i-essentiality of homological critical values conclude the paper.
منابع مشابه
Multidimensional persistence in biomolecular data
Persistent homology has emerged as a popular technique for the topological simplification of big data, including biomolecular data. Multidimensional persistence bears considerable promise to bridge the gap between geometry and topology. However, its practical and robust construction has been a challenge. We introduce two families of multidimensional persistence, namely pseudomultidimensional pe...
متن کاملReducing complexes in multidimensional persistent homology theory
The Forman’s discrete Morse theory appeared to be useful for providing filtration–preserving reductions of complexes in the study of persistent homology. So far, the algorithms computing discrete Morse matchings have only been used for one–dimensional filtrations. This paper is perhaps the first attempt in the direction of extending such algorithms to multidimensional filtrations. Initial frame...
متن کاملClassification of hepatic lesions using the matching metric
In this paper we present a methodology of classifying hepatic (liver) lesions using multidimensional persistent homology, the matching metric (also called the bottleneck distance), and a support vector machine. We present our classification results on a dataset of 132 lesions that have been outlined and annotated by radiologists. We find that topological features are useful in the classificatio...
متن کاملNumeric Invariants from Multidimensional Persistence
We extend the results of Adcock, Carlsson, and Carlsson ([ACC13]) by constructing numeric invariants from the computation of a multidimensional persistence module as given by Carlsson, Singh, and Zomorodian in [CSZ10]. The use of topology to study point cloud data has been well established ([Car09], [Car14]). Given a finite metric space (e.g., a finite set in R n), one first constructs a filter...
متن کاملA New Matching Algorithm for Multidimensional Persistence
An algorithm is presented that constructs an acyclic partial matching on the cells of a given simplicial complex from a vector-valued function defined on the vertices and extended to each simplex by taking the least common upper bound of the values on its vertices. The resulting acyclic partial matching may be used to construct a reduced filtered complex with the same multidimensional persisten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007